Ribbon tensorial logic A functorial bridge between proofs and knots

نویسنده

  • Paul-André Melliès
چکیده

Tensorial logic is a primitive logic of tensor and negation which refines linear logic by relaxing the hypothesis that tensorial negation A 7→ ¬A is involutive. The resulting logic of linear continuations provides a proof-theoretic account of game semantics, where the formulas and proofs of the logic reflect univoquely dialogue games and innocent strategies. In the present paper, we introduce a topologically-aware version of tensorial logic, called ribbon tensorial logic. We associate to every proof of the logic a ribbon tangle which tracks the flow of tensorial negations inside the proof. The translation is functorial: it is performed by exhibiting a correspondence between the notion of dialogue category in proof theory and the notion of ribbon category in knot theory. Our main theorem is that the translation is faithful: two tensorial proofs are equal modulo commuting conversions if and only if the associated ribbon tangles are equal up to topological deformation. The “proof-as-tangle” theorem may be also understood as a coherence theorem for ribbon dialogue categories. By connecting in this functorial way tensorial logic and knot theory, we hope to investigate further the unexpected topological nature of proofs and programs, and of their dialogical interpretation in game semantics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Slice-ribbon Conjecture for 3-stranded Pretzel Knots

We determine the (smooth) concordance order of the 3-stranded pretzel knots P (p, q, r) with p, q, r odd. We show that each one of finite order is, in fact, ribbon, thereby proving the slice-ribbon conjecture for this family of knots. As corollaries we give new proofs of results first obtained by Fintushel-Stern and Casson-Gordon.

متن کامل

THE SLICE-RIBBON CONJECTURE FOR 3-STRANDED PRETZEL KNOTS By JOSHUA GREENE and STANISLAV JABUKA

We determine the (smooth) concordance order of the 3-stranded pretzel knots P(p, q, r) with p, q, r odd. We show that each one of finite order is, in fact, ribbon, thereby proving the sliceribbon conjecture for this family of knots. As corollaries we give new proofs of results first obtained by Fintushel-Stern and Casson-Gordon.

متن کامل

Ribbon Proofs for Separation Logic A verification pearl

We present ribbon proofs, a diagrammatic proof system for separation logic. Inspired by an eponymous system due to Bean, ribbon proofs emphasise the structure of a proof, so are intelligible and hence useful pedagogically. Because they contain less redundancy than proof outlines, and allow each proof step to be checked locally, they are highly scalable (and we illustrate this with a ribbon proo...

متن کامل

Equivalence of symmetric union diagrams

Motivated by the study of ribbon knots we explore symmetric unions, a beautiful construction introduced by Kinoshita and Terasaka 50 years ago. It is easy to see that every symmetric union represents a ribbon knot, but the converse is still an open problem. Besides existence it is natural to consider the question of uniqueness. In order to attack this question we extend the usual Reidemeister m...

متن کامل

Ribbon Proofs

We present ‘Ribbon Proofs’, a graphical proof system for the Logic of Bunched Implications (BI). We give the informal, graphical, notation, we formalise the system algebraically and sketch the proof of its soundness and completeness. We discuss the spatial and geometrical nature of the proof system and its relation to BI’s spatial model theory.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016